Finding elliptic Fekete points sets: two numerical solution approaches
نویسندگان
چکیده
منابع مشابه
Computation of Elliptic Fekete Point Sets
The objective of this work is to provide a methodology for approximating globally optimal Fekete point con-gurations. This problem is of obvious interest in numerical mathematics and scientic modeling. Following a brief discussion of the pertinent analytical background, Lipschitz global optimization (LGO) is applied to determine {i.e., to numerically approximate{ Fekete point congurations. Next...
متن کاملFekete Points
In this communication we present a new method to estimate Fekete points on surfaces. Our method works in a general setting, in the sense that we can obtain good estimations of the Fekete points on piecewise regular surfaces. The determination of Fekete points in the unit sphere is considered as a model of a highly non-linear optimization problem with non-linear constraints. In fact, obtaining a...
متن کاملComputing Multivariate Fekete and Leja Points by Numerical Linear Algebra
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points for multivariate compact sets by basic tools of numerical linear algebra. The first gives the so-called “Approximate Fekete Points” by QR factorization with column pivoting of Vandermonde-like matrices. The second computes Discrete Leja Points by LU factorization with row pivoting. Moreover, we st...
متن کاملEstimation of Fekete points
In this paper we present a procedure for the numerical estimation of the Fekete points of a wide variety of compact sets in IR. We understand the problem of the Fekete points in terms of the identification of nearly equilibrium configurations for a potential energy that depends on the relative position of N particles. The compact sets for which our procedure has been designed can be described b...
متن کاملFinding Two Disjoint Simple Paths on Two Sets of Points is NP-Complete
Finding two disjoint simple paths on two given sets of points is a geometric problem introduced by Jeff Erickson. This problem has various applications in computational geometry, like robot motion planning, generating polygon etc. We will present a reduction from planar Hamiltonian path to this problem, and prove that it is NP-Complete. To the best of our knowledge, no study has considered its ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2001
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(99)00382-9